Poincaré’s rotation number and Morse’s type number
نویسندگان
چکیده
منابع مشابه
Rotation number and its properties for iterated function and non-autonomous systems
The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...
متن کاملAttractors with vanishing rotation number
Given an orientation-preserving homeomorphism of the plane, a rotation number can be associated with each locally attracting fixed point. Assuming that the homeomorphism is dissipative and the rotation number vanishes we prove the existence of a second fixed point. The main tools in the proof are Carathéodory prime ends and fixed point index. The result is applicable to some concrete problems i...
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملSelf-Rotation Number using the Turning Angle
The self-rotation number, as defined by Peckham, is the rotation rate of the image of a point about itself. Here we use the notion of “turning angle” to give a simplified algorithm to compute the selfrotation number for maps that “avoid an angle.” We show that the orientation preserving Hénon map does avoid an angle. Moreover, the self-rotation number for orbits of the Hénon map can be computed...
متن کاملThe number of binary rotation words
We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be Θ(n). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov [Problemy Kibernet. 39 (1982) 67–84], then independ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1932
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1932-1501630-8